Goal - Directed Tableaux ∗
نویسنده
چکیده
This paper contains a new format for analytic tableaux, called goaldirected tableaux. Their main interest lies in the fact that they are more efficient than the usual analytic tableaux (in general, they lead to less branching). They can also be used to develop an efficient tableaux-based approach to abduction. The goal-directed tableaux do not form a full decision method for propositional classical logic (because they do not sustain Ex Falso Quodlibet). For consistent sets of premises, however, they lead to the same results as the usual analytic tableaux for classical logic.
منابع مشابه
Abduction through Semantic Tableaux versus Abduction through Go
In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Aliseda’s approach based on semantic tableaux. We begin with some comments on Aliseda’s algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive e...
متن کاملClausal Graph Tableaux for Hybrid Logic with Eventualities and Difference
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no ...
متن کاملA Tableaux Decision Procedure for SHOIQ
This paper presents a tableaux decision procedure for SHOIQ, the DL underlying OWL DL. To the best of our knowledge, this is the first goal-directed decision procedure for SHOIQ.
متن کاملLuis Fariñas del Cerro Olivier Gasquet MINIMAL STRUCTURES FOR MODAL TABLEAUX : Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کاملMINIMAL STRUCTURES FOR MODAL TABLEAUX: Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کامل